Optimal and robust combination of forecasts via constrained optimization and shrinkage
نویسندگان
چکیده
We introduce various methods that combine forecasts using constrained optimization with penalty. A non-negativity constraint is imposed on the weights, and several penalties are considered, taking form of a divergence from reference combination scheme. In contrast most existing approaches, our framework performs forecast selection in one step, allowing for potentially sparse combining schemes. Moreover, by exploiting analogy between portfolio optimization, we provide analytical expression optimal penalty strength when penalizing L2-divergence equally-weighted An extensive simulation study two empirical applications allow us to investigate impact function, scheme, predictive performance. Our results suggest proposed models outperform those considered previous studies.
منابع مشابه
Averaging and the Optimal Combination of Forecasts
The optimal combination of forecasts, detailed in Bates and Granger (1969), has empirically often been overshadowed in practice by using the simple average instead. Explanations of why averaging might in practice work better than constructing the optimal combination have centered on estimation error and the e¤ects variations of the data generating process have on this error. The ip side of thi...
متن کاملOptimal combination of density forecasts
This paper brings together two important but hitherto largely unrelated areas of the forecasting literature, density forecasting and forecast combination. It proposes a simple data-driven approach to direct combination of density forecasts using optimal weights. These optimal weights are those weights that minimise the ‘distance’, as measured by the Kullback-Leibler Information Criterion, betwe...
متن کاملChance constrained uncertain classification via robust optimization
This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain datapoints are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as ...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملOptimal Neural Net Compression via Constrained Optimization
Compressing neural nets is an active research problem, given the large size of state-of-the-art nets for tasks such as object recognition, and the computational limits imposed by mobile devices. Firstly, we give a general formulation of model compression as constrained optimization. This makes the problem of model compression well defined and amenable to the use of modern numerical optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Forecasting
سال: 2022
ISSN: ['1872-8200', '0169-2070']
DOI: https://doi.org/10.1016/j.ijforecast.2021.04.002